<title>乘法逆元</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cmath&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-mi">3000005</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">p</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">p</span><span class="pl-p">);</span>
    <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">2</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span><span class="pl-p">)(</span><span class="pl-n">p</span> <span class="pl-o">-</span> <span class="pl-n">p</span> <span class="pl-o">/</span> <span class="pl-n">i</span><span class="pl-p">)</span> <span class="pl-o">*</span> <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-n">p</span> <span class="pl-o">%</span> <span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">%</span> <span class="pl-n">p</span><span class="pl-p">;</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ny</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>